Optimal Spatial Formation of Swarm Robotic Gas Sensors in Odor Plume Finding

Finding the best spatial formation of stationary gas sensors in detection of odor clues is the first step of searching for olfactory targets in a given space using a swarm of robots. Considering no movement for a network of gas sensors, this paper formulates the problem of odor plume detection and analytically finds the optimal spatial configuration of the sensors for plume detection, given a set of assumptions. This solution was analyzed and verified by simulations and finally experimentally validated in a reduced scale realistic environment using a set of Roomba-based mobile robots

Optimal Swarm Formation for Odor Plume Finding

This paper presents an analytical approach to the problem of odor plume finding by a network of swarm robotic gas sensors, and finds an optimal configuration for them, given a set of assumptions. Considering cross-wind movement for the swarm, we found that the best spatial formation of robots in finding odor plumes is diagonal line configuration with equal distance between each pair of neighboring robots. We show that the distance between neighboring pairs in the line topology depends mainly on the wind speed and the environmental conditions, whereas, the number of robots and the swarm's crosswind movement distance do not show significant impact on optimal configurations. These solutions were analyzed and verified by simulations and experimentally validated in a reduced scale realistic environment using a set of mobile robots

Multi-Robot Odor Distribution Mapping in Realistic Time-Variant Conditions

This paper tackles the problem of multi-robot odor distribution mapping through time series analysis. Considering the conditions of real world environments where the chemical concentration distribution is patchy, intermittent and time-variant, we propose a method to incorporate the temporal and spatial aspect of sensory data into the problem of odor distribution mapping. Despite the previous works in this field, the method gives more importance to the recent acquired measurements and also to the measurements which have been spatially closer to the place of the sensors (at the time of their acquisition). Real experiments were done in a realistic small scale controlled environment (designed for systematic olfactory tests), considering up to five real robots and two different navigation algorithms. Experiments show that the generated odor maps are remarkably more accurate than the results of the conventional spatial interpolation method. Studying various spatio-temporal neighborhoods in the time series analysis concluded that a proper definition of the neighborhood (in time and space) provides accurate results in gas distribution mapping

Swarm Robotic Plume Tracking for Intermittent and Time-Variant Odor Dispersion

This paper presents a method for odor plume tracking by a swarm of robots in realistic conditions. In real world environments, the chemical concentration within an odor plume is patchy, intermittent and time-variant. This study shows that swarm robots can cooperatively track the odor plume towards its source by establishing a cohesive spatial sensor network to deal with the turbulences and patchy nature of odor plumes. The robots move together and maintain a distance margin between themselves in order to keep the cohesion of the constructed sensor network while the odor concentration and air-flow speed are considered in the equations of navigation of the robots in the network to more efficiently track the plume. The method is evaluated in simulation against various number of robots, the emission rate of the odor source, the number of obstacles in the environment and the size of the testing environment. The emergent behavior of the swarm proves the functionality, robustness and scalability of the system in different conditions

Extending Urban Air Quality Maps Beyond the Coverage of a Mobile Sensor Network: Data Sources, Methods, and Performance Evaluation

Targeting the problem of generating high-resolution air quality maps for cities, we leverage four different sources of data: (i) in-situ air quality measurements produced by our mobile sensor network deployed on public transportation vehicles, (ii) explanatory air-quality and meteorological variables obtained from two static monitoring stations, (iii) land-use data of the city, and (iv) traffic statistics. We propose two novel approaches for estimating the targeted pollutant level at desired time-location pairs, extending also to areas of the city that are beyond the coverage of our mobile sensor network. The first is a log-linear regression model which is built over a virtual dependency graph based on land-use data. The second is a deep learning framework that automatically captures the dependencies of the data based on autoencoders. We have evaluated the two proposed approaches against three canonical modeling techniques considering metrics of coefficient of determination (R-squared), root mean square error (RMSE), and the fraction of predictions within a factor of two of observations (FAC2). Using more than 45 million real measurements in the models, the results show consistently superior performance in respect to the canonical techniques

Model-based Rendezvous Calibration of Mobile Sensor Networks for Monitoring Air Quality

Mobile Wireless Sensor Networks (WSNs) hold the potential to constitute a real game changer for our understanding of urban air pollution, through a significant augmentation of spatial resolution in measurement. However, temporal drift, crosssensitivity and effects caused by varying environmental conditions (e.g., temperature) in low-cost chemical sensors (typically used in mobile WSNs) pose a tough challenge for reliable calibration. Based on state-of-the-art rendezvous calibration methods, we propose a novel model-based method for automatically estimating the baseline and gain characteristics of low-cost chemical sensors taking temporal drift and temperature dependencies of the sensors into account. The performance of our algorithm is evaluated using data gathered by our long-term mobile sensor network deployment, developed within the Nano-Tera.ch OpenSense II project in Lausanne, Switzerland. We show that, in a realistic context of sparse and irregular rendezvous events, our method consistently improves rendezvous calibration performance for single-hop online calibration

Enhancing Measurement Quality through Active Sampling in Mobile Air Quality Monitoring Sensor Networks

In recent years, a growing number of research groups have targeted the development and deployment of networks using low-cost chemical sensors for monitoring air quality. Due to economical reasoning, most of these systems make use of some sort of mobility to increase spatial coverage. The effect of mobility on measurement quality has, however, been largely neglected. The long response time of the chemical sensors typically used for this type of application, in conjunction with platform mobility, leads to significant signal distortion. While this problem can be addressed through signal deconvolution techniques, their effectiveness is limited by the typical poor Signal-to-Noise Ratio (SNR) of the measured signal. In this paper, we study the possibility of enhancing the measurement quality of chemical sensors through the use of active sampling (or sniffing). We propose different sniffer designs, employing both fans and pumps as actuators. Using a rigorous experimental framework, inside a wind tunnel, we study the ability of active samplers to increase measurement SNR, and thus indirectly to improve sensor dynamic response. We obtain a significant and consistent improvement in SNR for one of our pump-based sniffer designs. Finally, we validate the robustness of this signal enhancement in real-world conditions through an outdoor car-based experiment

Robotic clusters: Multi-robot systems as computer clusters A topological map merging demonstration

In most multi-robot systems, an individual robot is not capable of solving computationally hard problems due to lack of high processing power. This paper introduces the novel concept of robotic clusters to empower these systems in their problem solving. A robotic cluster is a group of individual robots which are able to share their processing resources, therefore, the robots can solve difficult problems by using the processing units of other robots. The concept, requirements, characteristics and architecture of robotic clusters are explained and then the problem of “topological map merging” is considered as a case study to describe the details of the presented idea and to evaluate its functionality. Additionally, a new parallel algorithm for solving this problem is developed. The experimental results proved that the robotic clusters remarkably speedup computations in multi-robot systems. The proposed mechanism can be used in many other robotic applications and has the potential to increase the performance of multi-robot systems especially for solving problems that need high processing resources

Mitigating Slow Dynamics of Low-Cost Chemical Sensors for Mobile Air Quality Monitoring Sensor Networks

The last decade has seen a growing interest in air quality monitoring using networks of wireless low-cost sensor platforms. One of the unifying characteristics of chemical sensors typically used in real-world deployments is their slow response time. While the impact of sensor dynamics can largely be neglected when considering static scenarios, in mobile applications chemical sensor measurements should not be considered as point measurements (i.e. instantaneous in space and time). In this paper, we study the impact of sensor dynamics on measurement accuracy and locality through systematic experiments in the controlled environment of a wind tunnel. We then propose two methods for dealing with this problem: (i) reducing the effect of the sensor's slow dynamics by using an open active sampler, and (ii) estimating the underlying true signal using a sensor model and a deconvolution technique. We consider two performance metrics for evaluation: localization accuracy of specific field features and root mean squared error in field estimation. Finally, we show that the deconvolution technique results in consistent performance improvement for all the considered scenarios, and for both metrics, while the active sniffer design considered provides an advantage only for feature localization, particularly for the highest sensor movement speed

Adaptive Lévy Taxis for Odor Source Localization in Realistic Environmental Conditions

Odor source localization with mobile robots has recently been subject to many research works, but remains a challenging task mainly due to the large number of environmental parameters that make it hard to describe gas concentration fields. We designed a new algorithm called Adaptive Lévy Taxis (ALT) to achieve odor plume tracking through a correlated random walk. In order to compare its performances with well-established solutions, we have implemented three moth-inspired algorithms on the same robotic platform. To improve the performance of the latter algorithms, we developed a rigorous way to determine one of their key parameters, the odor concentration threshold at which the robot considers to be inside or outside the plume. The methods have been systematically evaluated in a large wind tunnel under various environmental conditions. Experiments revealed that the performance of ALT is consistently good in all environmental conditions (in particular when compared to the three reference algorithms) in terms of both distance traveled to find the source and success rate